Combinatorial algorithms for packing and scheduling problems
نویسنده
چکیده
منابع مشابه
Development of a Genetic Algorithm for Advertising Time Allocation Problems
Commercial advertising is the main source of income for TV channels and allocation of advertising time slots for maximizing broadcasting revenues is the major problem faced by TV channel planners. In this paper, the problem of scheduling advertisements on prime-time of a TV channel is considered. The problem is formulated as a multi-unit combinatorial auction based mathematical model. This is a...
متن کاملAsymptotic Methods in the Probabilistic Analysis of Packing and Partitioning Algorithms
Traditionally, the analysis of computer algorithms has concentrated on combinatorial methods, with the primary objective being worst-case performance bounds. However, in the last 10 years there has been a dramatic increase in the probabilistic analysis of algorithms. One reason is obvious and suggests that the trend will continue: the statistical behavior of an algorithm and the objective it pr...
متن کاملBin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems can be used to model task and resource allocation problems in multi-agent systems and distributed systems, and can also be found as subproblems of scheduling problems. We propose bin completion, a branch-and-bound stra...
متن کاملApproximation Algorithms for 2-dimensional Packing and Related Scheduling Problems
Main subject of this thesis are approximation algorithms for scheduling and packing, two classical geometrical problems in combinatorial optimization. It is divided into three parts. In the first part we consider a generalization of the strip packing problem or geometrical cutting stock problem. In strip packing a given set of rectangles has to be placed into a strip of fixed width and infinite...
متن کاملPrimal - Dual Algorithms for Combinatorial Optimization Problems
Title of dissertation: PRIMAL-DUAL ALGORITHMS FOR COMBINATORIAL OPTIMIZATION PROBLEMS Julián Mestre Doctor of Philosophy, 2007 Dissertation directed by: Professor Samir Khuller Department of Computer Science Combinatorial optimization problems such as routing, scheduling, covering and packing problems abound in everyday life. At a very high level, a combinatorial optimization problem amounts to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006